Guided Local Search
نویسندگان
چکیده
Guided Local Search (GLS) is an intelligent search scheme for combinatorial optimization problems. A main feature of the approach is the iterative use of local search. Information is gathered from various sources and exploited to guide local search to promising parts of the search space. The application of the method to the Travelling Salesman Problem and the Quadratic Assignment Problem is examined. Results reported show that the algorithm outperforms or compares very favorably with well-known and established optimization techniques such as simulated annealing and tabu search. Given the novelty of the approach and the very encouraging results, the method could have an important contribution to the development of intelligent search techniques for combinatorial optimization.
منابع مشابه
A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...
متن کاملPredicting Normal People’s Reaction Time based on Hippocampal Local Efficiency During a Memory-Guided Attention Task
Background: There are some convincing shreds of evidence indicating that memory can direct attention. The local efficiency of an area in the brain, as a quantitative feature in a complex network, indicates how the surrounding nodes can transfer the information when a specific node is omitted. This feature is a scale for measuring efficient integration of information in the brain. Objectives:...
متن کاملExtending Guided Local Search – Towards a Metaheuristic Algorithm With No Parameters To Tune
Guided Local Search is a general penalty-based optimisation method that sits on top of local search methods to help them escape local optimum. It has been applied to a variety of problems and demonstrated effective. The aim of this paper is not to produce further evidence that Guided Local Search is an effective algorithm, but to present an extension of Guided Local Search that potentially has ...
متن کاملAn Empirical Study of Extended Guided Local Search on the Quadratic Assignment Problem
In this paper, we show how an Extended Guided Local Search can be applied to the Quadratic Assignment Problem and show the extensions can improve its performance. GLS is a general, penalty-based meta-heuristic, which sits on top of local search algorithms, to help guide them out of local minima. GLS has been shown to be successful in solving a number of practical real life problems, such as the...
متن کاملTitle : Guided Local Search and Its Application to the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. In this paper, we are going to examine how the techniques of Guided Local Search (GLS) and Fast Local Search (FLS) can be applied to the problem. Guided Local Search sits on top of local search heuristics and has as a main aim to guide these procedures in exploring efficiently and effectively ...
متن کامل